Yet another approach to the extended ternary Golay code
نویسندگان
چکیده
منابع مشابه
Yet another approach to the extended ternary Golay code
A new proof of the uniqueness and of the existence of the extended ternary Golay code is presented. The proof connects the code to the projective plane of order 3 and is of an elementary nature. The available proofs of the uniqueness of the extended ternary Golay code [2,7] are much more complicated than the standard corresponding proof in the binary case [2]. The prevailing opinion seems to be...
متن کاملYet Another Distance-Regular Graph Related to a Golay Code
We describe a new distance-regular, but not distance-transitive, graph. This graph has intersection array {110, 81, 12; 1, 18, 90}, and automorphism group M22: 2. In [1], Brouwer, Cohen and Neumaier discuss many distance-regular graphs related to the famous Golay codes. In this note, we describe yet another such graph. Ivanov, Linton, Lux, Saxl and the author [4] have classified all primitive d...
متن کاملOn the universal embedding of the near hexagon related to the extended ternary Golay code
Let E1 be the near hexagon on 729 points related to the extended ternary Golay code. We prove in an entirely geometricway that the generating and embedding ranks ofE1 are equal to 24. We also study the structure of the universal embeddinge of E1. More precisely, we consider several nice subgeometries A of E1 and determine which kind of embeddingeA is, whereeA is the embedding of A induced by...
متن کاملConstructing the Extended Binary Golay Code
Coding theory is the subject which is concerned with how information can be sent over a noisy channel. A code then is a collection of codewords which are strings of a fixed number of letters from an alphabet. Some of these strings are codewords others are not. When a codeword is sent over a channel there is a probability less than /2 that each letter in the codeword will be changed, thus introd...
متن کاملThe Golay Code Outperforms the Extended Golay Code Under Hard-Decision Decoding
We show that the binary Golay code is slightly more power efficient than the extended binary Golay code under maximum-likelihood (ML), hard-decision decoding. In fact, if a codeword from the extended code is transmitted, one cannot achieve a higher probability of correct decoding than by simply ignoring the 24th symbol and using an ML decoder for the non-extended code on the first 23 symbols. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00387-4